- directed flow network
- ориентированная сеть
Англо-русский словарь по компьютерной безопасности. Академик.ру. 2011.
directed flow network
Смотреть что такое "directed flow network" в других словарях:
Flow network — In graph theory, a flow network is a directed graph where each edge has a capacity and each edge receives a flow. The amount of flow on an edge cannot exceed the capacity of the edge. Often in Operations Research, a directed graph is called a… … Wikipedia
Flow — may refer to:In science and technology: *Dataflow, computing term related to the flow of messages between software components *Environmental flow, the amount of water necessary in a watercourse to maintain a healthy ecosystem *Flow (computer… … Wikipedia
Network coding — is a technique where, instead of simply relaying the packets of information they receive, the nodes of a network will take several packets and combine them together for transmission. This can be used to attain the maximum possible information… … Wikipedia
Directed attention fatigue — (DAF) is a neurological phenomenon that results from overuse of the brain’s inhibitory attention mechanisms, which handle incoming distractions while maintaining focus on a specific task. The greatest threat to a given focus of attention is… … Wikipedia
Directed percolation — In statistical physics Directed Percolation (DP) refers to a class of models that mimic filtering of fluids through porous materials along a given direction. Varying the microscopic connectivity of the pores, these models display a phase… … Wikipedia
Maximum flow problem — An example of a flow network with a maximum flow. The source is s, and the sink t. The numbers denote flow and capacity. In optimization theory, the maximum flow problem is to find a feasible flow through a single source, single sink flow network … Wikipedia
Max-flow min-cut theorem — In optimization theory, the max flow min cut theorem states that in a flow network, the maximum amount of flow passing from the source to the sink is equal to the minimum capacity which when removed in a specific way from the network causes the… … Wikipedia
Signal-flow graph — A signal flow graph (SFG) is a special type of block diagram[1] and directed graph consisting of nodes and branches. Its nodes are the variables of a set of linear algebraic relations. An SFG can only represent multiplications and additions.… … Wikipedia
Social network — For other uses, see Social network (disambiguation). Sociology … Wikipedia
Nowhere-zero flow — In graph theory, nowhere zero flows are a special type of network flow which is related (by duality) to coloring planar graphs. Let G = (V,E) be a directed graph and let M be an abelian group. We say that a map is a flow or an M flow if the… … Wikipedia
Social-circles network model — The generative model of feedback networks [Cited by Wei, Wang, Qiuping, Nivanen, Lauret et al (2006 01 12) [http://www.citebase.org/abstract?id=oai%3AarXiv.org%3Aphysics%2F0601091 How to fit the degree distribution of the air network?] ] , [Cited … Wikipedia
